On random reductions from sparse sets to tally sets
نویسندگان
چکیده
منابع مشابه
On Random Reductions from Sparse Sets to Tally Sets
We s h o w that every sparse set S can be many-one reduced to an appropriate tally set T by a polynomial-time, randomized reduction (see formal deenitions below.) Since T is in NP if S is in NP, this result can be used to show that there is a tally set in NP being randomized many-one complete for all sparse sets in NP. This partially answers an open problem posed by Hartmanis and Yesha 6]. In 6...
متن کاملOn Reductions of NP Sets to Sparse Sets
We prove unlikely consequences of the existence of sparse hard sets for P under deterministic as well as one-sided error randomized truth-table reductions. Our main results are as follows. We establish that the existence of a polynomially dense hard set for P under (randomized) logspace bounded truth-table reductions implies that P (R)L, and that the collapse goes down to P (R)NC 1 in case of r...
متن کاملLearning Reductions to Sparse Sets
We study the consequences of NP having non-uniform polynomial size circuits of various types. We continue the work of Agrawal and Arvind [1] who study the consequences of Sat being many-one reducible to functions computable by non-uniform circuits consisting of a single weighted threshold gate. (Sat ≤m LT1). They claim that P = NP follows as a consequence, but unfortunately their proof was inco...
متن کاملMonotonous and Randomized Reductions to Sparse Sets
An oracle machine is called monotonous, if after a negative answer the machine does not ask further queries to the oracle. For example, one truth-table, conjunctive, and Hausdorr reducibilities are monotonous. We study the consequences of the existence of sparse hard sets for diierent complexity classes under monotonous and randomized reductions. We prove trade-oos between the randomized time c...
متن کاملUniversitt at Ulm Fakultt at F Ur Informatik Bounded Truth-table and Conjunctive Reductions to Sparse and Tally Sets Universitt at Ulm Bounded Truth-table and Conjunctive Reductions to Sparse and Tally Sets
In this paper we study the consequences of the existence of sparse hard sets for diierent complexity classes under certain types of deterministic, randomized and nondeterministic reductions. We show that if an NP-complete set is bounded-truth-table reducible to a set that conjunctively reduces to a sparse set then P = NP. Relatedly, we show that if an NP-complete set is bounded-truth-table redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1993
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90102-f